全文获取类型
收费全文 | 9683篇 |
免费 | 1912篇 |
国内免费 | 1408篇 |
专业分类
电工技术 | 899篇 |
综合类 | 1264篇 |
化学工业 | 585篇 |
金属工艺 | 198篇 |
机械仪表 | 407篇 |
建筑科学 | 329篇 |
矿业工程 | 192篇 |
能源动力 | 194篇 |
轻工业 | 627篇 |
水利工程 | 161篇 |
石油天然气 | 365篇 |
武器工业 | 131篇 |
无线电 | 1337篇 |
一般工业技术 | 1112篇 |
冶金工业 | 229篇 |
原子能技术 | 92篇 |
自动化技术 | 4881篇 |
出版年
2024年 | 39篇 |
2023年 | 229篇 |
2022年 | 330篇 |
2021年 | 487篇 |
2020年 | 508篇 |
2019年 | 499篇 |
2018年 | 387篇 |
2017年 | 414篇 |
2016年 | 494篇 |
2015年 | 484篇 |
2014年 | 708篇 |
2013年 | 691篇 |
2012年 | 836篇 |
2011年 | 860篇 |
2010年 | 667篇 |
2009年 | 623篇 |
2008年 | 674篇 |
2007年 | 796篇 |
2006年 | 599篇 |
2005年 | 537篇 |
2004年 | 401篇 |
2003年 | 310篇 |
2002年 | 266篇 |
2001年 | 206篇 |
2000年 | 165篇 |
1999年 | 129篇 |
1998年 | 98篇 |
1997年 | 90篇 |
1996年 | 84篇 |
1995年 | 65篇 |
1994年 | 51篇 |
1993年 | 46篇 |
1992年 | 41篇 |
1991年 | 29篇 |
1990年 | 33篇 |
1989年 | 22篇 |
1988年 | 17篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 13篇 |
1982年 | 8篇 |
1981年 | 3篇 |
1980年 | 7篇 |
1978年 | 3篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1951年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
多种退化类型混合的图像比单一类型的退化图像降质更严重,很难建立精确模型对其复原,研究端到端的神经网络算法是复原的关键.现有的基于操作选择注意力网络的算法(operation-wiseattentionnetwork,OWAN)虽然有一定的性能提升,但是其网络过于复杂,运行较慢,复原图像缺乏高频细节,整体效果也有提升的空间.针对这些问题,提出一种基于层级特征融合的自适应复原算法.该算法直接融合不同感受野分支的特征,增强复原图像的结构;用注意力机制对不同层级的特征进行动态融合,增加模型的自适应性,降低了模型冗余;另外,结合L1损失和感知损失,增强了复原图像的视觉感知效果.在DIV2K,BSD500等数据集上的实验结果表明,该算法无论是在峰值信噪比和结构相似性上的定量分析,还是在主观视觉质量方面,均优于OWAN算法,充分证明了该算法的有效性. 相似文献
3.
4.
5.
Zhijiang Li Yingping Zheng Liqin Cao Lei Jiao Yanfei Zhong Caiyi Zhang 《Color research and application》2020,45(4):656-670
Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results. 相似文献
6.
7.
Qilin Liu Feng Ding 《International Journal of Adaptive Control and Signal Processing》2021,35(10):1970-1989
The identification of the Hammerstein–Wiener (H-W) systems based on the nonuniform input–output dataset remains a challenging problem. This article studies the identification problem of a periodically nonuniformly sampled-data H-W system. In addition, the product terms of the parameters in the H-W system are inevitable. In order to solve the problem, the key-term separation is applied and two algorithms are proposed. One is the key-term-based forgetting factor stochastic gradient (KT-FFSG) algorithm based on the gradient search. The other is the key-term-based hierarchical forgetting factor stochastic gradient (KT-HFFSG) algorithm. Compared with the KT-FFSG algorithm, the KT-HFFSG algorithm gives more accurate estimates. The simulation results indicate that the proposed algorithms are effective. 相似文献
8.
Very high resolution inverse synthetic aperture radar (ISAR) imaging of fast rotating targets is a complicated task. There may be insufficient pulses or may introduce migration through range cells (MTRC) during the coherent processing interval (CPI) when we use the conventional range Doppler (RD) ISAR technique. With compressed sensing (CS) technique, we can achieve the high-resolution ISAR imaging of a target with limited number of pulses. Sparse representation based method can achieve the super resolution ISAR imaging of a target with a short CPI, during which the target rotates only a small angle and the range migration of the scatterers is small. However, traditional CS-based ISAR imaging method generally faced with the problem of basis mismatch, which may degrade the ISAR image. To achieve the high resolution ISAR imaging of fast rotating targets, this paper proposed a pattern-coupled sparse Bayesian learning method for multiple measurement vectors, i.e. the PC-MSBL algorithm. A multi-channel pattern-coupled hierarchical Gaussian prior is proposed to model the pattern dependencies among neighboring range cells and correct the MTRC problem. The expectation-maximization (EM) algorithm is used to infer the maximum a posterior (MAP) estimate of the hyperparameters. Simulation results validate the effectiveness and superiority of the proposed algorithm. 相似文献
9.
AbstractMulti-agent systems need to communicate to coordinate a shared task. We show that a recurrent neural network (RNN) can learn a communication protocol for coordination, even if the actions to coordinate are performed steps after the communication phase. We show that a separation of tasks with different temporal scale is necessary for successful learning. We contribute a hierarchical deep reinforcement learning model for multi-agent systems that separates the communication and coordination task from the action picking through a hierarchical policy. We further on show, that a separation of concerns in communication is beneficial but not necessary. As a testbed, we propose the Dungeon Lever Game and we extend the Differentiable Inter-Agent Learning (DIAL) framework. We present and compare results from different model variations on the Dungeon Lever Game. 相似文献
10.
In this paper, we first re-examine the previous protocol of controlled quantum secure direct communication of Zhang et al.’s scheme, which was found insecure under two kinds of attacks, fake entangled particles attack and disentanglement attack. Then, by changing the party of the preparation of cluster states and using unitary operations, we present an improved protocol which can avoid these two kinds of attacks. Moreover, the protocol is proposed using the three-qubit partially entangled set of states. It is more efficient by only using three particles rather than four or even more to transmit one bit secret information. Given our using state is much easier to prepare for multiqubit states and our protocol needs less measurement resource, it makes this protocol more convenient from an applied point of view. 相似文献